PRISM-Games 2.0: A Tool for Multi-objective Strategy Synthesis for Stochastic Games

نویسندگان

  • Marta Z. Kwiatkowska
  • David Parker
  • Clemens Wiltsche
چکیده

We present a new release of PRISM-games, a tool for verification and strategy synthesis for stochastic games. PRISM-games 2.0 significantly extends its functionality by supporting, for the first time: (i) long-run average (mean-payoff) and ratio reward objectives, e.g., to express energy consumption per time unit; (ii) strategy synthesis and Pareto set computation for multi-objective properties; and (iii) compositional strategy synthesis, where strategies for a stochastic game modelled as a composition of subsystems are synthesised from strategies for individual components using assume-guarantee contracts on component interfaces. We demonstrate the usefulness of the new tool on four case studies from autonomous transport and energy management.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantitative verification and strategy synthesis for stochastic games

Design and control of computer systems that operate in uncertain, competitive or adversarial, environments can be facilitated by formal modelling and analysis. In this paper, we focus on analysis of complex computer systems modelled as turn-based 21/2-player games, or stochastic games for short, that are able to express both stochastic and non-stochastic uncertainty. We offer a systematic overv...

متن کامل

PRISM-games: A Model Checker for Stochastic Multi-Player Games

We present PRISM-games, a model checker for stochastic multi-player games, which supports modelling, automated verification and strategy synthesis for probabilistic systems with competitive or cooperative behaviour. Models are described in a probabilistic extension of the Reactive Modules language and properties are expressed using rPATL, which extends the well-known logic ATL with operators to...

متن کامل

Model Checking and Strategy Synthesis for Stochastic Games: From Theory to Practice

Probabilistic model checking is an automatic procedure for establishing if a desired property holds in a probabilistic model, aimed at verifying quantitative probabilistic specifications such as the probability of a critical failure occurring or expected time to termination. Much progress has been made in recent years in algorithms, tools and applications of probabilistic model checking, as exe...

متن کامل

Synthesis for Multi-objective Stochastic Games: An Application to Autonomous Urban Driving

We study strategy synthesis for stochastic two-player games with multiple objectives expressed as a conjunction of LTL and expected total reward goals. For stopping games, the strategies are constructed from the Pareto frontiers that we compute via value iteration. Since, in general, infinite memory is required for deterministic winning strategies in such games, our construction takes advantage...

متن کامل

Assume-Guarantee Strategy Synthesis for Stochastic Games

This thesis presents a framework for the automatic strategy synthesis fromquantitative specifications, in order to control autonomous systems. Wemodel systems as turn-based two-player zero-sum stochastic games, whichare able to express both stochastic and nondeterministic environmentaluncertainty. Given a system model and a specification, we define thestrategy synthesis prob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016